Cinderella: Computation, complexity, geometry

نویسنده

  • Ulrich Kortenkamp
چکیده

With Cinderella[12], you can easily create constructions, figures consisting of points, lines, circles, conics and other geometric elements, together with relations that describe the mathematical connections between the elements.[5] A standard example is a triangle, consisting of three points and three segments connecting each pair of points, and the altitudes in that triangle. The representation of the construction within the software makes it possible to move the vertices of the triangle (using the mouse) and get a new drawing for each position while the segments and the altitudes are updated accordingly. The mathematical core of Cinderella is based on projective geometry and Cayley-Klein geometries for maximal generality. All geometric constructions are designed to work in all meaningful situations and to have as few special cases as possible. At the same time it is possible to have different, simultaneous, interactive views of a geometric construction, like its 2D representation, a spherical projection, polarized versions of this or special views like the Poincaré disk for hyperbolic geometry. As soon as multi-valued geometric constructions, like the intersections of two circles or conics, or angle bisectors, are used, it is necessary to handle these with special care to avoid mathematical inconsistencies. Using a continuation technique on associated Riemann surfaces[4] Cinderella can guarantee – up to numerical errors – that continuous changes of parameters (i.e. free points) will cause continuous changes of the construction (within its realization space). As a consequence we do have a notion of “dynamic theorems”, consisting of a sequence of geometric construction steps and an element of the “fiber” over a given assignment of free values as a “germ.” The theory behind this gives rise to several mathematical questions that are interesting on their own,[6] but are not covered here. The intuitive user interface of Cinderella hides most of the mathematical details but exposes the mathematical content of geometry and makes a proper handling of geometry available not only for academic research, but also

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Making the Move: the next Version of Cinderella

Cinderella is a software package for interactive or dynamic geometry. Its first version was published in 1999 and was the first geometry software to be based on the theory of complex tracing3, thus avoiding mathematical inconsistencies and unmotivated discontinuities (modulo numerical errors). At the ICMS 2002 we will introduce the next major version of Cinderella and highlight its new features...

متن کامل

KETCindy – linkage between dynamic geometry and TEX graphics – Masataka

TEX has become most major tool to edit teaching materials in collegiate mathematics education because it provides high quality output of mathematical expressions and automates most aspects of publishing features. However, it is not so easy for teachers to generate high quality “graphics” in final output of TEX. We have developed KETpic which is a macro package of Computer Algebra System (CAS) t...

متن کامل

Software Engineering and Complexity in Effective Algebraic Geometry

We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model, adapted to Scientific Computing, which captures all known branching parsimonious symbolic algorithms in effective Algebraic Geometry. We justify this model by arguments from Software Engineering. Finally ...

متن کامل

Tutorial: Exact Numerical Computation in Algebra and Geometry

Many problems in Computational Science & Engineering (CS&E) are defined on the continuum. Standard algorithms for these problems are numerical and approximate. Their computational techniques include iteration, subdivision, and approximation. Such techniques are rarely seen in exact or algebraic algorithms. In this tutorial, we discuss a mode of computation called exact numerical computation (EN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002